A modified Newton iteration for finding nonnegative Z-eigenpairs of a nonnegative tensor

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Newton-Based Optimization for Nonnegative Tensor Factorizations

Tensor factorizations with nonnegative constraints have found application in analyzing data from cyber traffic, social networks, and other areas. We consider application data best described as being generated by a Poisson process (e.g., count data), which leads to sparse tensors that can be modeled by sparse factor matrices. In this paper we investigate efficient techniques for computing an app...

متن کامل

Nonnegative Matrix Factorization via Newton Iteration for Shared-memory Systems∗

Nonnegative Matrix Factorization (NMF) can be used to approximate a large nonnegative matrix as a product of two smaller nonnegative matrices. This paper shows in detail how an NMF algorithm based on Newton iteration can be derived utilizing the general Karush-KuhnTucker (KKT) conditions for first-order optimality. This algorithm is suited for parallel execution on shared-memory systems. It was...

متن کامل

Finding the Largest Eigenvalue of a Nonnegative Tensor

In this paper we propose an iterative method for calculating the largest eigenvalue of an irreducible nonnegative tensor. This method is an extension of a method of Collatz (1942) for calculating the spectral radius of an irreducible nonnegative matrix. Numerical results show that our proposed method is promising. We also apply the method to studying higher-order Markov chains.

متن کامل

Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations

Tensor factorizations with nonnegative constraints have found application in analyzing data from cyber traffic, social networks, and other areas. We consider application data best described as being generated by a Poisson process (e.g., count data), which leads to sparse tensors that can be modeled by sparse factor matrices. In this paper we investigate efficient techniques for computing an app...

متن کامل

A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor

We propose an inverse iterative method for computing the Perron pair of an irreducible nonnegative third order tensor. The method involves the selection of a parameter θk in the kth iteration. For every positive starting vector, the method converges quadratically and is positivity preserving in the sense that the vectors approximating the Perron vector are strictly positive in each iteration. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Algorithms

سال: 2018

ISSN: 1017-1398,1572-9265

DOI: 10.1007/s11075-018-0498-y